#include "Sort.h"

void Test()
{
	int a[] = { 1,3,5,7,8,9,2,4,6,0 };
	/*InsertSort(a, sizeof(a) / sizeof(a[0]));
	PrintArray(a, sizeof(a) / sizeof(a[0]));
	ShellSort(a, sizeof(a) / sizeof(a[0]));
	PrintArray(a, sizeof(a) / sizeof(a[0]));
	HeapSort(a, sizeof(a)/ sizeof(int));
	PrintArray(a, sizeof(a) / sizeof(a[0]));*/
	BubbleSort(a, sizeof(a) / sizeof(int));
	PrintArray(a, sizeof(a) / sizeof(a[0]));
}

void TestOP()
{
	srand((size_t)time(NULL));
	const int N = 100000;

	int* a1 = (int*)malloc(sizeof(int) * N);
	int* a2 = (int*)malloc(sizeof(int) * N);
	int* a3 = (int*)malloc(sizeof(int) * N);
	int* a4 = (int*)malloc(sizeof(int) * N);

	for (int i = 0; i < N; i++)
	{
		a1[i] = rand() + i;
		a2[i] = a1[i];
		a3[i] = a1[i];
		a4[i] = a1[i];

	}

	int begin1 = clock();
	InsertSort(a1,N);
	int end1 = clock();

	int begin2 = clock();
	ShellSort(a2, N);
	int end2 = clock();

	int begin3 = clock();
	HeapSort(a3, N);
	int end3 = clock();

	int begin4 = clock();
	BubbleSort(a4, N);
	int end4 = clock();

	printf("InsertSort : %d\n", end1 - begin1);
	printf("ShelltSort : %d\n", end2 - begin2);
	printf("HeapSort : %d\n", end3 - begin3);
	printf("BubbleSort : %d\n", end4 - begin4);

	free(a1);
	free(a2);
	free(a3);
	free(a4);
}

int main()
{
	TestOP();
	//Test();

	return 0;
}